Power Aware with the Survivable Routing Algorithm for Mobile Ad Hoc Networks

The mobile ad hoc networks are gaining importance because of their versatility, mobility and ability to work with a limited infrastructure. In the mobile ad hoc network, each node works as a router as well as host. It is generally decentralized network, where all network activities include route discovery and message delivery must be executed by the nodes themselves. In this paper, we present a power-aware with survivable routing algorithm for the mobile ad hoc networks to route the data packets from the source to destination. It works based on the transmission-power and relay-capacity of the node. Both source and destination pair uses the route-selection-window mechanism to route the data packets. The model has simulated using C++ language. The proposed model has tested under various conditions and compared with the minimum total transmission power routing model and min-max battery cost routing model. The simulation results show that the proposed model has increased the route survivability and throughput. It decreases the number of path reconstructions over the network.